Hadamard matrices of Williamson type: A challenge for Computer Algebra

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unified Particle Swarm Optimization for Hadamard matrices of Williamson type

In this work we apply the recently proposed Unified Particle Swarm Optimization (UPSO) method to the search for Hadamard matrices of the Williamson type. The objective functions that arise from the classical Williamson construction, are ideally suited for UPSO algorithms. This is the first time that swarm intelligence methods are applied to this problem. Mathematics Subject Classification (2000...

متن کامل

A new construction for Williamson-type matrices

It is shown that if q is a prime power then there are Williamson-type matrices of order (i) 1/2q2(q + 1) when q ≡ 1 (mod 4), (ii)1/4q2(q + 1) when q ≡ 3 (mod 4) and there are Williamson-type matrices of order l/4(q + 1). This gives Williamson-type matrices for the new orders 363, 1183, 1805, 2601, 3174, 5103. The construction can be combined with known results on orthogonal designs to give an H...

متن کامل

On the asymptotic existence of complex Williamson Hadamard matrices

It is shown that for each odd integer q, there is a complex WilliamsonHadamard matrix of order 2(q)+1 ·2n (q)+1 . q. In a recent paper Craigen, Holzmann and Kharaghani [1] showed that for every odd integer q) there is an integer N( q) which does not exceed twice the number of nonzero digits in the binary expansion of q, such that the existence of an Orthogonal Design (OD) of order 2N (q)-1 impl...

متن کامل

Computer generation of Hadamard matrices

We develop a computer code that uses elegant bit-manipulation techniques for matrix multiplication and thus facilitates exhaustive generation of Skew-Hadamard matrices. Hadamard matrices are useful in spectroscopic applications (Hadamard transform spectroscopy) and in balanced chemical designs. Application of our code yields several Skew-Hadamard matrices up to order 100 X 100, although the com...

متن کامل

New skew-Hadamard matrices via computational algebra

In this paper we formalize three constructions for skew-Hadamard matrices from a Computational Algebra point of view. These constructions are the classical 4 Williamson array construction, an 8 Williamson array construction and a construction based on OD(16; 1, 1, 2, 2, 2, 2, 2, 2, 2), a 9-variable full orthogonal design of order 16. Using our Computational Algebra formalism in conjunction with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2009

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2007.05.004